/*
 *	quicksort test
 *
 *	This file is part of OTAWA
 *	Copyright (c) 2015, IRIT UPS.
 *
 *	OTAWA is free software; you can redistribute it and/or modify
 *	it under the terms of the GNU General Public License as published by
 *	the Free Software Foundation; either version 2 of the License, or
 *	(at your option) any later version.
 *
 *	OTAWA is distributed in the hope that it will be useful,
 *	but WITHOUT ANY WARRANTY; without even the implied warranty of
 *	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *	GNU General Public License for more details.
 *
 *	You should have received a copy of the GNU General Public License
 *	along with OTAWA; if not, write to the Free Software
 *	Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
 */

#include <elm/data/quicksort.h>
#include <elm/data/Vector.h>
#include "../include/elm/test.h"

using namespace elm;

TEST_BEGIN(quicksort)

	Vector<int> v;
	v.add(4);
	v.add(0);
	v.add(2);
	v.add(1);
	v.add(3);

	quicksort(v);

	bool ok = true;
	for(int i = 0; i < v.length(); i++)
		if(v[i] != i) {
			ok = false;
			break;
		}
	CHECK(ok);

TEST_END

